Visibility Graphs and Oriented
نویسنده
چکیده
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank 3 oriented matroid can be constructed in polynomial time, which if affinely coordinatizable yields a simple polygon whose visibility graph is isomorphic to the given graph.
منابع مشابه
New skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملOn characterizing terrain visibility graphs
A terrain is an x-monotone polygonal line in the xy-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are...
متن کاملFurther results on arc and bar k-visibility graphs
We consider visibility graphs involving bars and arcs in which lines of sight can pass through at most k objects. We prove a new edge bound for arc k-visibility graphs, provide maximal constructions for arc visibility graphs and semi-arc k-visibility graphs, and give a complete characterization of semi-arc visibility graphs. We further show that the family of arc i-visibility graphs is never co...
متن کاملOn Visibility Graphs — Upper Bounds and Classification of Special Types
We examine several types of visibility graphs: bar and semi-bar k-visibility graphs, rectangle k-visibility graphs, arc and circle k-visibility graphs, and compact visibility graphs. We improve the upper bound on the thickness of bar k-visibility graphs from 2k(9k − 1) to 6k, and prove that the upper bound must be at least k + 1. We also show that the upper bound on the thickness of semi-bar k-...
متن کاملSome Results on Point Visibility Graphs
In this paper, we present three necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time ...
متن کامل